Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
نویسندگان
چکیده
منابع مشابه
Tail-scope: Using friends to estimate heavy tails of degree distributions in large-scale complex networks
Many complex networks in natural and social phenomena have often been characterized by heavy-tailed degree distributions. However, due to rapidly growing size of network data and concerns on privacy issues about using these data, it becomes more difficult to analyze complete data sets. Thus, it is crucial to devise effective and efficient estimation methods for heavy tails of degree distributio...
متن کاملAsymmetry in in-degree and out-degree distributions of large-scale industrial networks
Many natural, physical and social networks commonly exhibit power-law degree distributions. In this paper, we discover previously unreported asymmetrical patterns in the degree distributions of incoming and outgoing links in the investigation of large-scale industrial networks, and provide interpretations. In industrial networks, nodes are firms and links are directed supplier-customer relation...
متن کاملTail Dependence for Heavy-Tailed Scale Mixtures of Multivariate Distributions
The tail dependence of multivariate distributions is frequently studied via the tool of copulas. This paper develops a general method, which is based on multivariate regular variation, to evaluate the tail dependence of heavy-tailed scale mixtures of multivariate distributions, whose copulas are not explicitly accessible. Tractable formulas for tail dependence parameters are derived, and a suff...
متن کاملTuning degree distributions of scale - free networks
We present an algorithm that generates networks in which the skewness of the degree distribution is tuneable by modifying the preferential attachment step of the Barabási-Albert construction algorithm. Skewness is linearly correlated with the maximal degree of the network and, therefore, adequately represents the influence of superspreaders or hubs. By combining our algorithm with work of Holme...
متن کاملDegree and Sensitivity: Tails of Two Distributions
The sensitivity of a Boolean function f is the maximum, over all inputs x, of the number of sensitive coordinates of x (namely the number of Hamming neighbors of x with different f -value). The well-known sensitivity conjecture of Nisan (see also Nisan and Szegedy) states that every sensitivity-s Boolean function can be computed by a polynomial over the reals of degree poly(s). The best known u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2015
ISSN: 2045-2322
DOI: 10.1038/srep09752